Methodologies and Algorithms for Group-Rankings Decision

نویسندگان

  • Dorit S. Hochbaum
  • Asaf Levin
چکیده

T problem of group ranking, also known as rank aggregation, has been studied in contexts varying from sports, to multicriteria decision making, to machine learning, to ranking Web pages, and to behavioral issues. The dynamics of the group aggregation of individual decisions has been a subject of central importance in decision theory. We present here a new paradigm using an optimization framework that addresses major shortcomings that exist in current models of group ranking. Moreover, the framework provides a specific performance measure for the quality of the aggregate ranking as per its deviations from the individual decision-makers’ rankings. The new model for the group-ranking problem presented here is based on rankings provided with intensity— that is, the degree of preference is quantified. The model allows for flexibility in decision protocols and can take into consideration imprecise beliefs, less than full confidence in some of the rankings, and differentiating between the expertise of the reviewers. Our approach relaxes frequently made assumptions of: certain beliefs in pairwise rankings; homogeneity implying equal expertise of all decision makers with respect to all evaluations; and full list requirement according to which each decision maker evaluates and ranks all objects. The option of preserving the ranks in certain subsets is also addressed in the model here. Significantly, our model is a natural extension and generalization of existing models, yet it is solvable in polynomial time. The group-rankings models are linked to network flow techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining

Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...

متن کامل

Examination of the similarity between a new Sigmoid function-based consensus ranking method and four commonly-used algorithms

The problem of aggregating individual rankings to create an overall consensus ranking representative of the group is of longstanding interest in group decision making. The problem arises in situations where a group of k Decision Makers (DMs) are asked to rank order n alternatives. The question is how to combine the DMs’ rankings into one consensus ranking. Several different approaches have been...

متن کامل

Hospital rankings: a new challenge for MCDA and preference learning?

The aim of this paper is to convince the MultiCriteria Decision Aid (MCDA) and Preference Learning communities to investigate and to contribute in the development of methodologies dedicated to hospital ranking. To do so, we present the French hospital ranking and show how these rankings can be built properly through two existing methods: decision tree and ELECTRE Tri.

متن کامل

Dynamic programming methodology for multi-criteria group decision-making under ordinal preferences

A method of minimizing rankings inconsistency is proposed for a decision-making problem with rankings of alternatives given by multiple decision makers according to multiple criteria. For each criteria, at first, the total inconsistency between the rankings of all alternatives for the group and the ones for every decision maker is defined after the decision maker weights in respect to the crite...

متن کامل

Appraisal of the evolutionary-based methodologies in generation of artificial earthquake time histories

Through the last three decades different seismological and engineering approaches for the generation of artificial earthquakes have been proposed. Selection of an appropriate method for the generation of applicable artificial earthquake accelerograms (AEAs) has been a challenging subject in the time history analysis of the structures in the case of the absence of sufficient recorded accelerogra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Management Science

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2006